package leetcode_2501_2600;

public class LeeCode_2562 {
    public static void main(String[] args) {

    }
    private static long findTheArrayConcVal(int[] nums) {
        long ans = 0;
        int n = nums.length, l = 0, r = n - 1;
        while (l < r){
            long num = Long.parseLong(Integer.toString(nums[l]) + nums[r]);
            l++;
            r--;
            ans += num;
        }
        if (l == r){
            ans += nums[l];
        }
        return ans;
    }
}
